A Superclass of Edge-Path-Tree graphs with few cliques

Edge-Path-Tree graphs are intersection graphs of Edge-Path-Tree matrices that is matrices whose columns are incidence vectors of edge-sets of paths in a given tree. Edge-Path-Tree graphs have polynomially many cliques as proved in [4] and [7]. Therefore, the problem of finding a clique of maximum weight in these graphs is solvable in strongly polynomial time. In this paper we extend this result to a proper superclass of Edge-Path-Tree graphs. Each graph in the class is defined as the intersection graph of a matrix with no submatrix in a set W of seven small forbidden submatrices. By forbidding an eighth small matrix, our result specializes to Edge-Path-Tree graph

Curriculum-based course timetabling with student flow, soft constraints, and smoothing objectives: an application to a real case study

This paper deals with curriculum-based course timetabling. In particular, we describe the results of a real application at the University of Rome “Tor Vergata.” In this regard, we developed a multi-objective mixed-integer model which attempts to optimize (i) the flow produced by the students enrolled in the lectures, (ii) soft conflicts produced by the possible overlap among compulsory and non-compulsory courses, and (iii) the number of lecture hours per curriculum within the weekdays. The model has been implemented and solved by means of a commercial solver and experiments show that the model is able to provide satisfactory solutions as compared with the real scenario under consideration

A bi-objective model for scheduling green investments in two-stage supply chains

Investing in green technologies to increase sustainability in supply chains has become a common practice for two reasons: the first is directly related to the defense of the environment and people’s health to smooth the emissions of pollutants; the second is the increasing consumer awareness of green products. Despite the higher costs of producing with green technologies and processes, there is also a higher markup on the price of products which rewards the former costs. This study proposes a mathematical model for scheduling green investments over time in a two-stage supply chain to minimize the impact of production on the environment and the economic costs deriving from the investment. The resulting bi-objective model has nonlinear constraints and is solved using a commercial solver. Given its complexity, we propose an upper-bound heuristic and a lower-bound model to reduce the optimality gap attained at a given time limit. Tests on synthetic instances have been conducted, and an example demonstrates the applicability and efficacy of the proposed model

A New Lower Bound for the Resource-Constrained Project Scheduling Problem with Generalized Precedence Relations

In this paper we propose a new lower bound for the resource constrained project scheduling problem with generalized precedence relationships. The lower bound is based on a relaxation of the resource constraints among independent activities and on a solution of the relaxed problem suitably represented by means of an AON acyclic network. Computational results are presented and confirmed a better practical performance of the proposed method with respect to the those present in the literatur

Sustainable two stage supply chain management: A quadratic optimization approach with a quadratic constraint

Designing a supply chain to comply with environmental policy requires awareness of how work and/or production methods impact the environment and what needs to be done to reduce those environmental impacts and make the company more sustainable. This is a dynamic process that occurs at both the strategic and operational levels. However, being environmentally friendly does not necessarily mean improving the efficiency of the system at the same time. Therefore, when allocating a production budget in a supply chain that implements the green paradigm, it is necessary to figure out how to properly recover costs in order to improve both sustainability and routine operations, offsetting the negative environmental impact of logistics and production without compromising the efficiency of the processes to be executed. In this paper, we study the latter problem in detail, focusing on the CO2 emissions generated by the transportation from suppliers to production sites, and by the production activities carried out in each plant. We do this using a novel mathematical model that has a quadratic objective function and all linear constraints except one, which is also quadratic, and models the constraint on the budget that can be used for green investments caused by the increasing internal complexity created by large production flows in the production nodes of the supply network. To solve this model, we propose a multistart algorithm based on successive linear approximations. Computational results show the effectiveness of our proposal

A Bi-objective cap-and-trade model for minimising environmental impact in closed-loop supply chains

A Closed-Loop Supply Chain (CLSC) is a complex network with unique environmental features and attributes that requires specific managerial policies and strategies. Quantitative models can provide a solid basis for these policies and strategies. This study expands the work of Shoaeinaeini et al. (2021) on Green Supply Chain Management. We propose a bi-objective facility location, demand allocation, and pricing model for CLSC networks. The proposed model considers two conflicting objective functions: maximising profits and minimising emissions. We show consumer environmental awareness can predict the products’ rate of return and determine a more suitable price for new products and the acquisition price for used products. The cap-and-trade policy has been implemented at its fullest potential, allowing the trading of carbon quotas. Therefore, companies may decide to produce less to sell more quotas or vice-versa, effectively picking the most profitable option. The model is solved and tested with the commercial solver BARON. The model effectively shows the trade-off between generating profits and emission reduction. Companies are able to turn a profit while abiding by the government’s intention of reducing emissions. The comparison with a single-objective version of the model highlights that the concurrent optimisation of economic and environmental objectives yields better results. The acquisition price of used products is a value worthy of monitoring. The government should focus on policies to assist the reverse flow of used products

An Exact algorithm to minimize the makespan in project scheduling with scarce resources and feeding precedence relations

In this paper we study an extension of the Resource-Constrained Project Scheduling Problem (RCPSP) with minimum makespan objective by introducing as precedence constraints the so called “Feeding Precedences” (FP). For the RCPSP with FP we propose a new mathematical formulation and a branch and bound algorithm exploiting the latter formulation. The exact algorithm takes advantage also of a lower bound based on a Lagrangian relaxation of the same formulation. A computational experimentation on randomly generated instances and a comparison with the results achieved by a commercial solver, show that the proposed approach is able to behave satisfactorily

Minimizing the completion time of a project under resource constraints and feeding precedence relations: a Lagrangian relaxation based lower bound

In this paper we study an extension of the classical Resource-Constrained Project Scheduling Problem (RCPSP) with minimum makespan objective by introducing a further type of precedence constraints denoted as “Feeding Precedences” (FP). This kind of problem happens in that production planning environment, like make-to-order manufacturing, when the effort associated with the execution of an activity is not univocally related to its duration percentage and the traditional finish-to-start prece- dence constraints or the generalized precedence relations cannot completely represent the overlapping among activities. In this context we need to introduce in the RCPSP the FP constraints. For this problem we propose a new mathematical formulation and define a lower bound based on a resource constraints Lagrangian relaxation. A computational experimentation on randomly generated instances of sizes of up to 100 activities show a better performance of this lower bound with respect to others. More- over, for the optimally solved instances, its value is very close to the optimal one

A tight relation between series--parallel graphs and bipartite distance hereditary graphs

Bandelt and Mulder’s structural characterization of bipartite distance hereditary graphs asserts that such graphs can be built inductively starting from a single vertex and by re17 peatedly adding either pendant vertices or twins (i.e., vertices with the same neighborhood as an existing one). Dirac and Duffin’s structural characterization of 2–connected series–parallel graphs asserts that such graphs can be built inductively starting from a single edge by adding either edges in series or in parallel. In this paper we give an elementary proof that the two constructions are the same construction when bipartite graphs are viewed as the fundamental graphs of a graphic matroid. We then apply the result to re-prove known results concerning bipartite distance hereditary graphs and series–parallel graphs and to provide a new class of polynomially-solvable instances for the integer multi-commodity flow of maximum valu

Coloring algorithms and their application to project scheduling

Coordinatore Gianni Di Pillo. Tutore Paolo Dell'OlmoConsiglio Nazionale delle Ricerche - Biblioteca Centrale - P.le Aldo Moro, 7 , Rome; Biblioteca Nazionale Centrale - P.za Cavalleggeri, 1, Florence / CNR - Consiglio Nazionale delle RichercheSIGLEITItal